Cyclic Scheduling of Flexible Job-shop with Time Window Constraints and Resource Capacity Constraints
نویسندگان
چکیده
منابع مشابه
Cyclic Scheduling of Flexible Job-shop with Time Window Constraints and Resource Capacity Constraints
This paper deals with the cyclic scheduling of flexible job-shop with time window constraints and resource capacity constraints. For time window constraints, the duration for processing products on machines and the duration for translating products from one machine to another by transfers are taken into account; for the resource capacity constraints, the confined operation space of machines and...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملflexible job shop scheduling under availability constraints
in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...
متن کاملQualitative Constraints for Job Shop Scheduling
This paper introduces a translation of the job shop scheduling problem into a qualitative constraint satisfaction problem using INDU and Allen relations. We show that the translation is sound and complete. We also use the notion of frozen constraints and show that it allows the user to consider only partial solutions when searching for solutions. Our work constitutes a new approach to the probl...
متن کاملSolving an integrated job-shop problem with human resource constraints
We propose two exact methods to solve an integrated employee-timetable and job-shop-scheduling problem. The problem is to find a minimum cost employee-timetable, where employees have different competences and work during shifts, so that the production, that corresponds to a job-shop with resource availability constraints, can be achieved. We introduce two new exact procedures: 1) a decompositio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.06.184